Probabilistic Proactive Timeline Browser
نویسندگان
چکیده
We have developed a browser suitable for finding events from timelines, in particular from life logs and other timelines containing a familiar narrative. The system infers the relevance of events based on the user’s browsing behavior and increases the visual saliency of relevant items along the timeline. As recognized images are strong memory cues, the user can quickly determine if the salient images are relevant and, if they are, it is quick and easy to select them by clicking since they are salient. Even if the inferred relevance was not correct, the timeline will help: The user may remember if the sought event was before or after a saliently shown event which limits the search space. A user study shows that the browser helps in locating relevant images quicker, and augmenting explicit click feedback with implicit mouse movement patterns further improves the performance.
منابع مشابه
Lost in Memories: Interacting With Large Photo Collections on PDAs
We developed two browsers to support large photo collections on PDAs. Our first browser uses a traditional, folder-based layout that utilizes either the user’s manually created organization structure, or a system-generated structure. Our second browser uses a novel interface that is based on a vertical, zoomable timeline. This Timeline browser does not require users to organize their photos, bu...
متن کاملAdventures in Space and Time: Browsing Personal Collections of Geo-Referenced Digital Photographs
We evaluate two novel applications for browsing personal collections of geo-referenced digital photographs. The first, PhotoCompas, is a browser that employs no graphical user interface elements other than the photos themselves (textual browser). PhotoCompas was developed in our project, and is based on an automated organization of the respective photo collection into clustered locations and ev...
متن کاملExtracting and Re-using Structured Data from Wikis
This report investigates simplifying the creation of structured data for use in Semantic Web applications. In the first phase of work, a prototype is created that extracts structured data on companies and unstructured data on acquisitions from Wikipedia. It then reuses this information in a data browser that can provide faceted, map and timeline views. In the second phase, we investigate more g...
متن کاملProactive Algorithms for Scheduling with Probabilistic Durations
Proactive scheduling seeks to generate high quality solutions despite execution time uncertainty. Building on work in [Beck and Wilson, 2004], we conduct an empirical study of a number of algorithms for the job shop scheduling problem with probabilistic durations. The main contributions of this paper are: the introduction and empirical analysis of a novel constraint-based search technique that ...
متن کاملMulti-Document Relationship Fusion via Constraints on Probabilistic Databases
Previous multi-document relationship extraction and fusion research has focused on single relationships. Shifting the focus to multiple relationships allows for the use of mutual constraints to aid extraction. This paper presents a fusion method which uses a probabilistic database model to pick relationships which violate few constraints. This model allows improved performance on constructing c...
متن کامل